THE FINITE FOURIER TRANSFORM OF CLASSICAL POLYNOMIALS

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Finite Fourier Transform of Classical Polynomials

The finite Fourier transform of a family of orthogonal polynomials is the usual transform of these polynomials extended by 0 outside their natural domain of orthogonality. Explicit expressions are given for the Legendre, Jacobi, Gegenbauer and Chebyshev families. 2010 Mathematics subject classification: primary 33C45; secondary 44A38, 33C47, 33C10, 42C10.

متن کامل

Finite Fourier Transform, Circulant Matrices, and the Fast Fourier Transform

Suppose we have a function s(t) that measures the sound level at time t of an analog audio signal. We assume that s(t) is piecewise-continuous and of finite duration: s(t) = 0 when t is outside some interval a ≤ t ≤ b. Make a change of variable x = (t− a)/(b− a) and set f(x) = s(t). Then 0 ≤ x ≤ 1 when a ≤ t ≤ b, and f(x) is a piecewise continuous function of x. We convert f(x) into a digital s...

متن کامل

Fourier Transform of Bernstein-Bézier Polynomials

Explicit formulae, in terms of Bernstein-Bézier coefficients, of the Fourier transform of bivariate polynomials on a triangle and univariate polynomials on an interval are derived in this paper. Examples are given and discussed to illustrate the general theory. Finally, this consideration is related to the study of refinement masks of spline function vectors. AMS Subject Classification: 42C40, ...

متن کامل

Properties of the Distributional Finite Fourier Transform

The analytic functions in tubes which obtain the distributional finite Fourier transform as boundary value are shown to have a strong boundedness property and to be recoverable as a Fourier-Laplace transform, a distributional finite Fourier transform, and as a Cauchy integral of a distribution associated with the boundary value.

متن کامل

The (finite field) Fast Fourier Transform

There are numerous directions from which one can approach the subject of the fast Fourier Transform (FFT). It can be explained via numerous connections to convolution, signal processing, and various other properties and applications of the algorithm. We (along with Geddes/Czapor/Labahn) take a rather simple view from the algebraic manipulation standpoint. As will be apparent shortly, we relate ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Australian Mathematical Society

سال: 2014

ISSN: 1446-7887,1446-8107

DOI: 10.1017/s1446788714000500